Lecture 10: Complementation via Alternating Automata
ثبت نشده
چکیده
The last theorem of Lecture 9 assures us that in any Büchi game one of the two players has a positional winning strategy. Thus, for any alternating Büchi automaton (ABA ) A and word w, either the automaton or the pathfinder has a positional winning strategy in the game G(A,w). Thus, if A accepts w there is a positional run for A on w. Consider the ABA A1 from the previous lecture. Here is a positional accepting run for this automaton on input bababaaaa . . ..
منابع مشابه
On Complementing Nondeterministic Büchi Automata
Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...
متن کاملTwo-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملAlternating Automata, the Weak Monadic Theory of Trees and its Complexity
Beginning with the fundamental article of Chandra et al. [2], the notation of alternation has clarified several results concerning the complexity of logical theories. Muller and Schupp [9] extended the idea of alternation to automata working on trees. Although such automata are a generalization of Rabin’s model [12] of nondeterministic automata working on infinite trees, complementation and, th...
متن کاملAlternation Elimination for Automata over Nested Words
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...
متن کاملAbstraction Refinement for Emptiness Checking of Alternating Data Automata
ion Refinement for Emptiness Checking of Alternating Data Automata Radu Iosif and Xiao Xu CNRS, Verimag, Université de Grenoble Alpes {Radu.Iosif,Xiao.Xu}@univ-grenoble-alpes.fr Abstract. Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009